A new class of symmetric block design

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Symmetric-Key Block Ciphering Algorithm

Strong cryptographic algorithms have been used for securing data communication. It is considered as one of the best tools to help people to protect their sensitive information from cryptanalysts when it is stored or transmitted via insecure communication channels. In this paper we present a novel symmetric-key block ciphering algorithm, MJEA (for Modified Jamal Encryption Algorithm). MJEA has a...

متن کامل

Some New Symmetric Block Designs EDWARD

In his book [I 1, Marshall Hall gives a table of balanced incomplete block designs with from 3 to 15 replications. It is mentioned there that a solution is unknown as to whether or not there exists a symmetric block design with parameters (v, k, h) = (36, 15, 6) (number 104 in the table). It is the purpose of this paper to show that such a design can in fact be constructed quite simply and to s...

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory

سال: 1969

ISSN: 0021-9800

DOI: 10.1016/s0021-9800(69)80127-4